Complete surfaces of at most quadratic area growth

Strongly Complete Axiomatizations of "Knowing at Most" in Syntactic Structures

Syntactic structures based on standard syntactic assignments model knowledge directly rather than as truth in all possible worlds as in modal epistemic logic, by assigning arbitrary truth values to atomic epistemic formulae. This approach to epistemic logic is very general and is used in several logical frameworks modeling multi-agent systems, but has no interesting logical properties — partly ...

Embeddedness of Minimal Surfaces with Total Boundary Curvature at Most

This paper proves that classical minimal surfaces of arbitrary topological type with total boundary curvature at most 4 must be smoothly embedded. Related results are proved for varifolds and for soap lm surfaces. In a celebrated paper N3] of 1973, Nitsche proved that if ? is an analytic simple closed curve in R 3 with total curvature at most 4, then ? bounds exactly one minimal disk M. Further...

Convolution surfaces of quadratic triangular Bézier surfaces

In the present paper we prove that the polynomial quadratic triangular Bézier surfaces are LN-surfaces. We demonstrate how to reparameterize the surfaces such that the normals obtain linear coordinate functions. The close relation to quadratic Cremona transformations is elucidated. These reparameterizations can be effectively used for the computation of convolution surfaces.

Growth of Metal Clusters at Surfaces

Solving Most Systems of Random Quadratic Equations

This paper deals with finding an n-dimensional solution x to a system of quadratic equations yi = |〈ai,x〉|, 1 ≤ i ≤ m, which in general is known to be NP-hard. We put forth a novel procedure, that starts with a weighted maximal correlation initialization obtainable with a few power iterations, followed by successive refinements based on iteratively reweighted gradient-type iterations. The novel...